求有效极小（受控）可重复向量的一个算法

文献［１］基于有效（受控）可重复向量，给出了判定一个标准Ｐｅｔｒｉ网产生的语言分别为正规语言或上下文无关语言的充要条件，然而，求取一个标准Ｐｅｔｒｉ网的有效（受控）可重复向量是着定网语言属型的前提条件，文献［１］没有给出求取它们的方法，本文提出一个算法，使得文献［１］判据可实现，此外，作为副产品，同时产生出网的所有极小Ｔ－不变量以及公平性判定的实现。     

Pd合金／Si接触过渡层的结构组分研究

淀积合金薄膜的 Si 片退火时,通过固相反应在界面处生成接触过渡层,其组分与结构均不同于一般条件下生成的硅化物.本文介绍了 Pd 合金/Si接触过渡层的形成工艺,对接触过渡层的结构组分进行了分析与讨论.基于“相分层”效应,可用掺氮或掺氧的方法提高阻挡层的质量.     

Comparison of spectral fluorescent signatures-based models to characterize DOM in treated water samples

Statistical procedures enable a multivariate analysis of the measurements to identify specific characteristics of the dissolved organic matter (DOM) fractions in raw natural water, including the concentrations. In this work, three already established models were used to predict the concentrations of fractions of DOM from spectral fluorescent signatures (SFSs): a general linear regression (GLR), loadings and scores of a principal components analysis (PCA), and a partial least squares regression (PLS). Details about the method undertaken to prepare the fractions were given. Water samples from surface water treatment plants in New Jersey were used for the testing. In all cases, PLS have shown much better biases and accuracies than GLR and PCA models. Hydrophilic neutral, however, showed poor performances (bias 33%) due to the isolation technique used. Recommendations were provided in order to improve the DOM characterization through SFS, which linked to PLS make a powerful and cost-effective surrogate parameter to characterize DOM.     

基于身份的代理盲签名技术研究

代理盲签名技术综合了代理签名和盲签名两种签名技术的特点,即原始签名人能将其数字签名权利委托给代理签名人,且消息的内容对签名者不可见,但可信第三方却成为其签名系统的薄弱环节.针对此问题,构造一种基于身份的代理盲签名方案,验证其不可伪造性、盲性和不可链接性,并将方法实际应用于公安刑事侦查系统中,理论和实践证明了方法的安全性...     

Integrating dispositions, signatures, and the interpersonal domain.

A person's behavior across situations can be characterized in terms of a mean level (disposition), a dispersion within the person around that mean level, and a stable organization to the pattern of dispersion (signature). The authors' goals were to examine the structure and stability of behavior, both at the level of behavioral dispositions and at the level of behavioral signatures. Participants completed event-contingent records of their social interactions over a 20-day period. Participants recorded their own social behavior (dominant, agreeable, submissive, quarrelsome) in 4 situations defined by the perceived social behavior of their primary interaction partners (agreeable-dominant, agreeable-submissive, quarrelsome- submissive, quarrelsome-dominant). Findings suggest that (a) once the normative influences of situations on behavior are removed, the remaining behavioral variation reflects both consistent cross-situational differences between individuals (dispositions) and consistent situational differences within individuals (signatures); (b) both dispositions and signatures display a 2-dimensional structure in adherence to the interpersonal circle; and (c) both dispositions and signatures constitute stable aspects of personality functioning. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

On high-speed computing with a programmable linear array

It has been observed by many researchers that systolic arrays are very suitable for certain high-speed computations. Using a formal methodology, we present a design for a single simple programmable linear systolic array capable of solving large numbers of problems drawn from a variety of applications. The methodology is applicable to problems solvable by sequential algorithms that can be specified as nested for-loops of arbitrary depth. The algorithms of this form that can be computed on the array presented in this paper include 25 algorithms dealing with signal and image processing, algebraic computations, matrix arithmetic, pattern matching, database operations, sorting, and transitive closure. Assuming bounded I/O, for 18 of those algorithms the time and storage complexities are optimal, and therefore no improvement can be expected by using dedicated special-purpose linear systolic arrays designed for individual algorithms. We also describe another design which, using a sufficient large local memory and allowing data to be preloaded and unloaded, has an optimal processor/time product.An earlier version of this paper was presented at Supercomputing '88.This work was partially supported by ONR under the contract N00014-85-K-0046 and by NSF under Grant Number CCR-8906949.     

A Simplified Õ(nm) Time Edge-Splitting Algorithm in Undirected Graphs

Let G=(V,E) be a multigraph which has a designated vertex s ∈ V with an even degree. For two edges e ₁ = (s,u ₁ ) and e ₂ = (s,u ₂ ) , we say that a multigraph G' is obtained from G by splitting e ₁ and e ₂ at s if two edges e ₁ and e ₂ are replaced with a single edge (u ₁ ,u ₂ ) . It is known that all edges incident to s can be split without losing the edge-connectivity of G in V-s . This complete splitting plays an important role in solving many graph connectivity problems. The currently fastest algorithm for a complete splitting [14] runs in O(n(m+n log n) log n) time, where n = |V| and m is the number of pairs of vertices between which G has an edge. Their algorithm is first designed for Eulerian multigraphs, and then extended for general multigraphs. Although the part for Eulerian multigraphs is simple, the rest for general multigraphs is considerably complicated. This paper proposes a much simpler O(n(m+n log n) log n) time algorithm for finding a complete splitting. A new edge-splitting theorem derived from our algorithm is also presented. Received March 13, 1997; revised October 10, 1997.     

Transitive filtration of Lie superalgebras

0　ＩＮＴＲＯＤＵＣＴＩＯＮＷｅｋｎｏｗｔｈａｔｆｉｌｔｒａｔｉｏｎｐｌａｙｓａｎｅｍｉｎｅｎｔｒｏｌｅｉｎｔｈｅｓｔｕｄｙｏｆＬｉｅａｌｇｅｂｒａｓａｎｄＬｉｅｓｕｐｅｒａｌｇｅｂｒａｓ .Ｍｏｒｅｏｖｅｒ,ｆｉｌｔｒａｔｉｏｎｉｓａｌｓｏａｋｉｎｄｏｆｅｆｆｅｃｔｉｖｅｍｅｔｈｏｄｓｆｏｒｓｏｌｖｉｎｇｐｒｏｂｌｅｍｓ .Ｆｏｒｅｘａｍｐｌｅ ,ｗｅｓｔｕｄｉｅｄＵ(Ｌ)ｂｙｍｅａｎｓｏｆｉｔｓｃａｎｏｎｉｃａｌｆｉｌｔｒａｔｉｏｎ(ｓｅｅＲｅｆ.[1]) .Ｔｈｅｃｌａｓｓｉｆｉｃａｔｉｏｎｏｆｔｈｅｎｏｎ…     

The efficiency of systematic sampling in stereology — reconsidered

In the present paper, we summarize and further develop recent research in the estimation of the variance of stereological estimators based on systematic sampling. In particular, it is emphasized that the relevant estimation procedure depends on the sampling density. The validity of the variance estimation is examined in a collection of data sets, obtained by systematic sampling. Practical recommendations are also provided in a separate section.